On geodetic sets formed by boundary vertices

نویسندگان

  • José Cáceres
  • M. Carmen Hernando
  • Mercè Mora
  • Ignacio M. Pelayo
  • María Luz Puertas
  • Carlos Seara
چکیده

Let G be a finite simple connected graph. A vertex v is a boundary vertex of G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types of boundary vertices: peripheral, contour and eccentric vertices. Before showing that one of the main results in [3] does not hold for one of the cases, we establish a realization theorem that not only corrects the mentioned wrong statement but also improves it. Given S ⊆ V (G), its geodetic closure I[S] is the set of all vertices lying on some shortest path joining two vertices of S. We prove that the boundary vertex set ∂(G) of any graph G is geodetic, that is, I[∂(G)] = V (G). A vertex v belongs to the contour Ct(G) of G if no neighbor of v has an eccentricity greater than v. We present some sufficient conditions to guarantee the geodeticity of either the contour Ct(G) or its geodetic closure I[Ct(G)].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the edge geodetic and edge geodetic domination numbers of a graph

In this paper, we study both concepts of geodetic dominatingand edge geodetic dominating sets and derive some tight upper bounds onthe edge geodetic and the edge geodetic domination numbers. We also obtainattainable upper bounds on the maximum number of elements in a partitionof a vertex set of a connected graph into geodetic sets, edge geodetic sets,geodetic domin...

متن کامل

Searching for geodetic boundary vertex sets

A vertex v is a boundary vertex of a connected graph G if there exists a vertex u such that no neighbor of v is further away from u than v. We obtain a number of properties involving different types of boundary vertices: peripheral, contour and eccentric vertices, including a realization theorem that not only corrects a wrong statement detected in [2], but also improves it. We also prove that t...

متن کامل

Some structural, metric and convex properties on the boundary of a graph

Let u, v ∈ V be two vertices of a connected graph G. The vertex v is said to be a boundary vertex of u if no neighbor of v is further away from u than v. The boundary of a graph is the set of all its boundary vertices. In this work, we present a number of properties of the boundary of a graph under different points of view: (1) a realization theorem involving different types of boundary vertex ...

متن کامل

On the geodetic number of median graphs

A set of vertices S in a graph is called geodetic if every vertex of this graph lies on some shortest path between two vertices from S. In this paper, minimum geodetic sets in median graphs are studied with respect to the operation of peripheral expansion. Along the way geodetic sets of median prisms are considered and median graphs that possess a geodetic set of size two are characterized. © 2...

متن کامل

On the geodetic number and related metric sets in Cartesian product graphs

A set S of vertices of a graph G is a geodetic set if every vertex of G lies in at least one interval between the vertices of S. The size of a minimum geodetic set in G is the geodetic number of G. Upper bounds for the geodetic number of Cartesian product graphs are proved and for several classes exact values are obtained. It is proved that many metrically defined sets in Cartesian products hav...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Discrete Mathematics

دوره 306  شماره 

صفحات  -

تاریخ انتشار 2006